A direct parallel sparse matrix solver
نویسندگان
چکیده
منابع مشابه
A NUMA Aware Scheduler for a Parallel Sparse Direct Solver
Over the past few years, parallel sparse direct solvers have made significant progress [1, 3, 4]. They are now able to solve efficiently real-life three-dimensional problems with several millions of equations. Since the last decade, most of the supercomputer architectures are based on clusters of SMP (Symmetric Multi-Processor) nodes. In [5], the authors proposed a hybrid MPI-thread implementat...
متن کاملA parallel sparse direct finite element solver for desktop computers
The parallel finite element solver, which is based on block L·S·L factoring, where S is a sign diagonal, is presented. The sparse symmetric positive definite and indefinite matrices are considered. Unlike the methods presented in the libraries of high-performance procedures, including PARDISO solver, the proposed approach uses the disk storage, if the dimension of the problem exceeds the capaci...
متن کاملPSPASES: An E cient and Scalable Parallel Sparse Direct Solver
Many problems in engineering and scienti c domains require solving large sparse systems of linear equations, as a computationally intensive step towards the nal solution. It has long been a challenge to develop e cient parallel formulations of sparse direct solvers due to several di erent complex steps involved in the process. In this paper, we describe PSPASES, one of the rst e cient, portable...
متن کاملPSPASES: An Efficient and Scalable Parallel Sparse Direct Solver
Many problems in engineering and scienti c domains require solving large sparse systems of linear equations, as a computationally intensive step towards the nal solution. It has long been a challenge to develop e cient parallel formulations of sparse direct solvers due to several di erent complex steps involved in the process. In this paper, we describe PSPASES, one of the rst e cient, portable...
متن کاملPspases: an Eecient and Scalable Parallel Sparse Direct Solver
Many problems in engineering and scientiic domains require solving large sparse systems of linear equations, as a computationally intensive step towards the nal solution. It has long been a challenge to develop eecient parallel formulations of sparse direct solvers due to several diierent complex steps involved in the process. In this paper, we describe PSPASES, one of the rst eecient, portable...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Physics Communications
سال: 1996
ISSN: 0010-4655
DOI: 10.1016/0010-4655(96)00007-0